Improved Query Processing in Web Search Engines Using Grey Wolf Algorithm
نویسندگان
چکیده
منابع مشابه
Query Processing in Highly-Loaded Search Engines
While Web search engines are built to cope with a large number of queries, query traffic can exceed the maximum query rate supported by the underlying computing infrastructure. We study how response times and results vary when, in presence of high loads, some queries are either interrupted after a fixed time threshold elapses or dropped completely. Moreover, we introduce a novel dropping strate...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملQuery Recommendation Using Query Logs in Search Engines
In this paper we propose a method that, given a query submitted to a search engine, suggests a list of related queries. The related queries are based in previously issued queries, and can be issued by the user to the search engine to tune or redirect the search process. The method proposed is based on a query clustering process in which groups of semantically similar queries are identified. The...
متن کاملA Study on Query Energy Consumption in Web Search Engines
Commercial web search engines are usually deployed on data centers, which leverage thousands of servers to efficiently answer queries on a large scale. Thanks to these distributed infrastructures, search engines can quickly serve high query volumes. However, the energy consumed by these many servers poses economical and environmental challenges for the Web search engine companies. To tackle suc...
متن کاملQuery Processing using Negative Tuples in Stream Query Engines
The concept of Negative Tuples (or delete tuples) has been adopted widely in data stream management systems to evaluate continuous sliding-window queries incrementally . The main idea is to produce a negative tuple for each expired tuple from the sliding window. Thus, various query operators can update their state based on the expired tuples. Negative tuples avoid the non-deterministic output d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i2.24.12081